package 力扣日常刷题.木23一月.第28天328;

public class Demo143数组归并排序 {


    int[] tmp ;
    public int[] sortArray(int[] nums) {
        tmp = new int[nums.length];
        mergerSort(nums,0,nums.length - 1);
        return nums;
    }

    public void mergerSort(int[] nums,int l,int r) {
        if(l >= r) return ;

        int mid = (l+r) >> 1;
        mergerSort(nums,l,mid);
        mergerSort(nums,mid+1,r);

        int i = l, j = mid + 1;
        int cnt = 0;
        while (i <= mid && j <= r) {

        }
    }
}
